Fault Hamiltoni ity of Two-Dimensional Torus Networks
نویسندگان
چکیده
Abstra t. In this paper, we onsider the hamiltonian properties of two-dimensional torus networks with the set F of faulty elements(verti es and/or edges). We will show that (1) if m 3, n 3, and n is odd, m n torus F is hamiltonianonne ted for any F with jF j 1, (2) if both m and n with m;n 4, are even, m n torus F is bihamiltonianonne ted for any F with jF j 1, and (3) if m 3, n 3, and n is odd, m n torus F has a hamiltonian y le for any F with jF j 2.
منابع مشابه
Construction of Edge-Disjoint Spanning Trees in the Torus and Application to Multicast in Wormhole-Routed Networks
A tree-based multicast algorithm for wormhole-routed torus networks, which makes use of multiple edge-disjoint spanning trees is presented. A technique for constructing two spanning trees in 2-dimensional torus networks is described. It is formally proven that this construction produces two edge-disjoint spanning trees in any 2-D torus network. Compared with an algorithm for construction of mul...
متن کاملMulticast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees
A tree-based multicast algorithm for wormhole-switched networks which makes use of multiple edge-disjoint spanning trees is presented. The disjoint spanning-tree multicast, or DSTM, algorithm provides deadlock-free multicast routing that is fully compatible with unicast. Application of the DSTM algorithm to 2-dimensional torus networks is considered. A family of constructions of two spanning tr...
متن کاملFault Tolerance in Optical Networks; A study of electronic in- and egress interconnections in Torus topologies
The ingress and egress nodes in an all-optical network have an electronic inand egress part and an optical switch. This work analyses various architectures for interconnection of the "electronic" and "optical" parts of the network in order to tolerate single optical switch failures and single optical link failures. The architectures studied are: non-redundant (reference), fault tolerant optical...
متن کاملTopology and Routing Algorithms of Double-Loops Connected Petersen Graph Networks
Petersen graph has good performance in parallel and distributed computation because of its characteristics such as short diameter and regularity. On the basis of topology of double-loops, a new double-loops connected Petersen graph network DLCPG(k) is constructed. In addition, unicasting, broadcasting and a kind of fault-tolerant routing algorithms are designed respectively. It is proved that D...
متن کامل